RDebug: A New Debugging Technique for Distributed R-Trees

نویسندگان

  • Sávio Salvarino Teles de Oliveira
  • José F. S. Filho
  • Vagner Jose do Sacramento Rodrigues
  • Marcelo de Castro Cardoso
  • Sérgio T. Carvalho
چکیده

The high data availability and the increasing number of GIS users have motivated the emergence of distributed algorithms to process spatial operations efficiently. They are based on distributed indexes for an high performance processing. Researches and ongoing work use R-trees as a distributed spatial structure for indexing and retrieval of geo objects. However, these indexes have shown a challenge, that is, how to debug an index which is based on an RTree? In the past few years researches have been published on both distributed algorithms and distributed processing. Though none of them has proposed a debugging technique to a distributed R-Tree index. This paper presents a new algorithm for debugging a distributed index based on R-Tree which is called RDebug. This algorithm was used on DistGeo, a platform to process distributed spatial operations. A graphic tool, named RDebug Visualizer, was developed to show the output of the RDebug algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Relative Debugging for Distributed Memory Applications: A Case Study

Relative debugging is a technique that addresses the problem of debugging programs that have been developed using evolutionary software techniques. Recent developments allow relative debugging to be used on programs that have been ported from serial to parallel architectures or between different parallel architectures. Such programs may change significantly in the porting process and this raise...

متن کامل

An Efficient Implementation of Vector Clocks in Dynamic Systems

A system of vector clocks is strongly consistent and it captures the happened before relations among events in the system. These clocks underlie solutions to a number of problems in distributed systems including, among others, detecting global predicates, debugging distributed programs, causally ordering multicast messages, and implementing a distributed shared memory. In general, a data struct...

متن کامل

Declarative Debugging of Rewriting Logic Specifications

Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree representing this computation and guiding the user through it to find the wrong statement. This paper presents the fundamentals for the declarative debugging of rewriting logic specifications, realized in the Maude language, wh...

متن کامل

Extensible Symbolic Debugging for Distributed Object Systems

After over thirty years of distributed computing, debugging distributed applications is still regarded as a difficult task. While it could be argued that this condition stems from the complexity of distributed executions, the fast pace of evolution witnessed with distributed computing technologies has also played its role by shortening the lifespan of many useful debugging tools. In this Master...

متن کامل

A New Technique for Verifying the Consistency of Distributed R-Trees

The ever-increasing of spatial datasets and the widely application of the complex computation have motivated the emergence of distributed algorithms to process spatial operations efficiently. The R-tree index is broadly used by researches as a distributed spatial structure for indexing and retrieval of spatial objects. However, a big challenge has arisen, that is, how to check the consistency o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014